Laplacian graph eigenvectors
نویسنده
چکیده
If G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. The main thrust of the present article is to prove several Laplacian eigenvector “principles” which in certain cases can be used to deduce the effect on the spectrum of contracting, adding or deleting edges and/or of coalescing vertices. One application is the construction of two isospectral graphs on 11 vertices having different degree sequences, only one of which is bipartite, and only one of which is decomposable.
منابع مشابه
Invertibility of graph translation and support of Laplacian Fiedler vectors
The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the i’th node is invertible if and only if all eigenvectors ar...
متن کاملPerturbation of the Eigenvectors of the Graph Laplacian: Application to Image Denoising
The original contributions of this paper are twofold: a new understanding of the influence of noise on the eigenvectors of the graph Laplacian of a set of image patches, and an algorithm to estimate a denoised set of patches from a noisy image. The algorithm relies on the following two observations: (1) the low-index eigenvectors of the diffusion, or graph Laplacian, operators are very robust t...
متن کاملSpectral Results for the Graph Laplacian
In this paper, we consider the Laplacian Operator on graphs, along with its eigenvectors and eigenvalues. After establishing preliminaries, we give eigenvector expansions for solutions of Electrical Network Boundary Value Problems. We then state some results for the nodal domains of our eigenvectors.
متن کاملNodal domain theorem for the graph p-Laplacian
In this work we consider the nonlinear graph p-Laplacian and the set of eigenvalues and associated eigenvectors of this operator defined by a variational principle. We prove a unifying nodal domain theorem for the graph p-Laplacian for any p ≥ 1. While for p > 1 the bounds on the number of weak and strong nodal domains are the same as for the linear graph Laplacian (p = 2), the behavior changes...
متن کاملHow can we naturally order and organize graph Laplacian eigenvectors?
When attempting to develop wavelet transforms for graphs and networks, some researchers have used graph Laplacian eigenvalues and eigenvectors in place of the frequencies and complex exponentials in the Fourier theory for regular lattices in the Euclidean domains. This viewpoint, however, has a fundamental flaw: on a general graph, the Laplacian eigenvalues cannot be interpreted as the frequenc...
متن کاملConvergence of Laplacian Eigenmaps
Geometrically based methods for various tasks of data analysis have attracted considerable attention over the last few years. In many of these algorithms, a central role is played by the eigenvectors of the graph Laplacian of a data-derived graph. In this paper, we show that if points are sampled uniformly at random from an unknown submanifold M of RN , then the eigenvectors of a suitably const...
متن کامل